Notes on Indirect Utility How do we show that the indirect utility function is quasi-convex? We want to show that if v(p, m) ≥ v(p0 , m0 ), then the indirect utility of the convex combination budget is worse than the i

Source URL: econ.ucsb.edu

• Operator theory
• Mathematics
• Representation theory of Lie groups
• Partial differential equations
• Spectral theory
• Mathematical analysis
• Ordinary differential equations

Midterm Exam, Econ 210A, FallElmer Kink’s utility function is min{x1 , 2x2 }. Draw a few indifference curves for Elmer. These are L-shaped, with the corners lying on the line x1 = 2x2 . Find each of the follow

Source URL: econ.ucsb.edu

• Concave function
• Convex function
• Hessian matrix
• Quasiconvex function
• PROPT
• Logarithmically concave function
• Mathematical analysis
• Mathematical optimization
• Convex analysis

Discrete Comput Geom 19:373–Discrete & Computational Geometry

Source URL: www.cs.duke.edu

• Discrete geometry
• Convex analysis
• Euclidean plane geometry
• K-set
• Crossing number
• Convex hull
• Convex function
• Arrangement of lines
• Pseudotriangle
• Mathematics
• Geometry
• Discrete mathematics

THE DIRICHLET PROBLEM FOR NONLOCAL OPERATORS WITH SINGULAR KERNELS: CONVEX AND NONCONVEX DOMAINS XAVIER ROS-OTON AND ENRICO VALDINOCI Abstract. We study the interior regularity of solutions to the Dirichlet problem Lu =

Source URL: www.ma.utexas.edu

• Fourier analysis
• Fractional calculus
• Constructible universe
• Mathematical analysis
• Sobolev spaces
• Mathematics

Discussion Paper NoA CHARACTERIZATION OF THE UNIFORM RULE WITH SEVERAL COMMODITIES AND AGENTS

Source URL: www.iser.osaka-u.ac.jp

• Convex analysis
• Structure
• Decision theory
• Calculus
• Continuous function
• Preference
• Ideal
• Utility
• Convex function
• Mathematics
• Mathematical analysis
• Algebraic structures

Using non-convex Approximations for Efficient Analysis of Timed Automata F. Herbreteau1 , D. Kini2 , B. Srivathsan1 and I. Walukiewicz1 LaBRI, Universit´ e de Bordeaux 1

Source URL: www.cmi.ac.in

ORF 522 Linear Programming and Convex Analysis Interior Point Methods Marco Cuturi

Source URL: www.iip.ist.i.kyoto-u.ac.jp

ORF 522 Linear Programming and Convex Analysis Network Flows Marco Cuturi

Source URL: www.iip.ist.i.kyoto-u.ac.jp

ORF 522 Linear Programming and Convex Analysis The Simplex Method Marco Cuturi

Source URL: www.iip.ist.i.kyoto-u.ac.jp

ORF 522 Linear Programming and Convex Analysis The geometry of the optimal solutions of an LP. Marco Cuturi

Source URL: www.iip.ist.i.kyoto-u.ac.jp